Timed CSP: A Retrospective
نویسندگان
چکیده
We review the development of the process algebra Timed CSP, from its inception nearly twenty years ago to very recent semantical and algorithmic developments.
منابع مشابه
Successful Termination in Timed CSP
In previous work the authors investigated the inconsistencies of how successful termination was modelled in Hoare, Brookes and Roscoe’s original CSP. This led to the definition of a variant of CSP, called CSPT . CSPT presents a solution to these problems by means of adding a termination axiom to the original process axioms. In this paper we investigate how successful process termination is mode...
متن کاملTimed CSP Simulator
Time is an integral aspect of computer systems. It is essential for modelling a system’s performance and also affects its safety or security. Timed Csp [5] conservatively extends the process algebra CSP with timed primitives, where real numbers ≥ 0 model how time passes with reference to a single, conceptually global, clock. While there have been approaches for model checking Timed Csp [1, 5], ...
متن کاملA Reasoning Method for Timed CSP Based on Constraint Solving
Timed CSP extends CSP by introducing a capability to quantify temporal aspects of sequencing and synchronization. It is a powerful language to model real time reactive systems. However, there is no verification tool support for proving critical properties over systems modelled using Timed CSP. In this work, we construct a reasoning method using Constraint Logic Programming (CLP) as an underlyin...
متن کاملSchedulability Analysis of Timed CSP Models Using the PAT Model Checker
Timed CSP can be used to model and analyse real-time and concurrent behaviour of embedded control systems. Practical CSP implementations combine the CSP model of a real-time control system with prioritized scheduling to achieve efficient and orderly use of limited resources. Schedulability analysis of a timed CSP model of a system with respect to a scheduling scheme and a particular execution p...
متن کاملSymbolic Model-Checking of Stateful Timed CSP Using BDD and Digitization
Stateful Timed CSP has been recently proposed to model (and verify) hierarchical real-time systems. It is an expressive modeling language which combines data structure/operations, complicated control flows (modeled using compositional process operators adopted from Timed CSP), and real-time requirements like deadline and within . It has been shown that Stateful Timed CSP is equivalent to closed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 162 شماره
صفحات -
تاریخ انتشار 2006